Cultural Ant Algorithm for Continuous Optimization Problems
نویسندگان
چکیده
منابع مشابه
Cultural Ant Algorithm for Continuous Optimization Problems
In order to overcome prematurity of ant colony algorithm, the conception of belief space originated in cultural algorithm is introduced, and a new cultural ant algorithm is proposed for continuous optimization problems. Firstly, the coding scheme for ant colony algorithm to solve continuous optimization problems is discussed. Then belief space is brought in, and designed as the form of two part...
متن کاملAnt-Stigmergy Algorithm on Real-World Continuous Optimization Problems
Ants have always fascinated human beings. What particularly strikes the occasional observer as well as the scientist is the high degree of societal organization that these insects can achieve in spite of very limited individual capabilities (Dorigo et al., 2000). Ants have inspired also a number of optimization algorithms. These algorithms are increasingly successful among researches in compute...
متن کاملelitist continuous ant colony optimization algorithm: application to reservoir operation problems
in this paper, a new continuous ant colony optimization (caco) algorithm is proposed for optimal reservoir operation. the paper presents a new method of determining and setting a complete set of control parameters for any given problem, saving the user from a tedious trial and error based approach to determine them. the paper also proposes an elitist strategy for caco algorithm where best solut...
متن کاملA unified ant colony optimization algorithm for continuous optimization
In this article, we propose UACOR, a unified ant colony optimization (ACO) algorithm for continuous optimization. UACOR includes algorithmic components from ACOR; DACOR and IACOR-LS, three ACO algorithms for continuous optimization that have been proposed previously. Thus, it can be used to instantiate each of these three earlier algorithms; in addition, from UACOR we can also generate new cont...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Information Sciences
سال: 2013
ISSN: 1935-0090,2325-0399
DOI: 10.12785/amis/072l47